Factoring multi-sublinear maps

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factoring Factor Maps

A noninjective bounded-to-one factor map from an irreducible shift of nite type onto a sooc system can be factored as a composition of other such maps in only nitely many ways (up to isomorphism). This generalizes to factor maps from systems with canonical coordinates to nitely presented dynamical systems. The analysis of bounded-to-one and especially of resolving factor maps has played a key r...

متن کامل

Amortized Sublinear Secure Multi Party Computation

We study the problem of secure two-party and multi-party computation in a setting where some of the participating parties hold very large inputs. Such settings increasingly appear when participants wish to securely query a database server, a typical situation in cloud related applications. Classic results in secure computation require work that grows linearly with the size of the input, while i...

متن کامل

ON THE SUBLINEAR OPERATORS FACTORING THROUGH Lq LAHCÈNE MEZRAG and ABDELMOUMENE TIAIBA

Let 0 < p ≤ q ≤ +∞. Let T be a bounded sublinear operator from a Banach space X into an Lp(Ω,μ) and let ∇T be the set of all linear operators ≤ T . In the present paper, we will show the following. Let C be a positive constant. For all u in ∇T , Cpq(u) ≤ C (i.e., u admits a factorization of the form X ũ → Lq(Ω,μ) Mgu → Lp(Ω,μ), where ũ is a bounded linear operator with ‖ũ‖ ≤ C , Mgu is the bo...

متن کامل

Factoring N-Cycles and Counting Maps of Given Genus

We present an explicit expression for the number of decompositions of an n−cycle as a product of any two permutations of cycle types given by partitions λ and μ. The same expression is also counting the number of unicellular rooted bicolored maps on an orientable surface of genus g with vertex degree distribution given by λ and μ. The relation between the genus and the partitions λ and μ is giv...

متن کامل

Sublinear Scaling for Multi-Client Private Information Retrieval

Private information retrieval (PIR) allows clients to retrieve records from online database servers without revealing to the servers any information about what records are being retrieved. To achieve this, the servers must typically do a computation involving the entire database for each query. Previous work by Ishai et al. has suggested using batch codes to allow a single client (or collaborat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Analysis

سال: 2014

ISSN: 0022-1236

DOI: 10.1016/j.jfa.2013.12.010